automatic theorem proving

См. также в других словарях:

• Automated theorem proving — (ATP) or automated deduction, currently the most well developed subfield of automated reasoning (AR), is the proving of mathematical theorems by a computer program. Decidability of the problem Depending on the underlying logic, the problem of… …   Wikipedia

• Isabelle (theorem prover) — Infobox Software name = Isabelle caption = collapsible = author = developer = released = latest release version = latest release date = latest maintenance version = latest maintenance date = latest preview version = latest preview date =… …   Wikipedia

• Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

• Demostración automática de teoremas — Saltar a navegación, búsqueda Para otros usos de este término, véase Demostración. La demostración automática de teoremas (de siglas ATP, por el término en inglés …   Wikipedia Español

• John Alan Robinson — is a philosopher (by training), mathematician and computer scientist. He is University Professor Emeritus at Syracuse University, United States.Alan Robinson s major contribution is to the foundations of automated theorem proving and logic… …   Wikipedia

• Resolution (logic) — In mathematical logic and automated theorem proving, resolution is a rule of inference leading to a refutation theorem proving technique for sentences in propositional logic and first order logic. In other words, iteratively applying the… …   Wikipedia

• Ross Overbeek — Infobox Scientist image width = 150px name = Ross A. Overbeek box width = birth date = birth place = Traverse City, Michigan death date = death place = residence = citizenship = nationality = ethnicity = field = Computer science; mathematical… …   Wikipedia

• Coq — For the coenzyme and dietary supplement, see Coenzyme Q10. Coq Paradigm(s) Functional Stable release 8.3 (October 2010; 12 months ago (2010 10)) …   Wikipedia

• Edmund M. Clarke — Edmund Melson Clarke, Jr. (born July 27,1945) is a computer scientist and academic noted for developing model checking, a method for formally verifying hardware and software designs.He is the FORE Systems Professor of Computer Science at Carnegie …   Wikipedia

• Cinderella (software) — The Interactive Geometry Software Cinderella Original author(s) Jürgen Richter Gebert and Ulrich Kortenkamp Initial release 1998 (1998) Stable release Cinderella.2 2.6 build 1585 / September 1, 2011; 50 days ago ( …   Wikipedia

• Programación lógica — Saltar a navegación, búsqueda La programación lógica consiste en la aplicación del corpus de conocimiento sobre lógica para el diseño de lenguajes de programación; no debe confundirse con la disciplina de la lógica computacional. La programación… …   Wikipedia Español